Parallel Graph Voronoi Diagram on the GPU
نویسندگان
چکیده
منابع مشابه
The graph Voronoi diagram with applications
The Voronoi diagram is a famous structure of computational geometry. We show that there is a straightforward equivalent in graph theory which can be eeciently computed. In particular, we give two algorithms for the computation of graph Voronoi diagrams, prove a lower bound on the problem, and we identify cases where the algorithms presented are optimal. The space requirement of a graph Voronoi ...
متن کاملA Theoretical Study of Parallel Voronoi Diagram
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log n) parallel algorithm for computing Voronoi diagram on the Euclidean plane. Our technique parallelizes the wellknown seemingly inherent sequential technique of Shamos and Hoey, and makes use of a number of special properties of the div...
متن کاملIncremental Construction of the Generalized Voronoi Diagram, the Generalized Voronoi Graph, and the Hierarchical Generalized Voronoi Graph
1 Overview This work introduces a new incremental construction procedure for the generalized Voronoi diagram (GVD), the locus of points equidistant to two obstacles. This procedure is incremental in that it requires line of sight information (see Figure 4) to construct the GVD. Note that this notion of incremental is di erent from previous de nition of incremental where the GVD is constructed b...
متن کاملParallel Voronoi Diagram computation on scaled distance planes using CUDA
Voronoi diagrams are fundamental data structures in computational geometry with several applications on different fields inside and outside computer science. This paper shows a CUDA algorithm to compute Voronoi diagrams on a 2D image where the distance between points cannot be directly computed in the euclidean plane. The proposed method extends an existing Dijkstra-based GPU algorithm to treat...
متن کاملOn the Farthest Line-Segment Voronoi Diagram
The farthest line-segment Voronoi diagram shows properties surprisingly different than the farthest point Voronoi diagram: Voronoi regions may be disconnected and they are not characterized by convexhull properties. In this paper we introduce the farthest line-segment hull, a cyclic structure that relates to the farthest line-segment Voronoi diagram similarly to the way an ordinary convex hull ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cii2017/17259